possible collision
Nearest Neighbor Future Captioning: Generating Descriptions for Possible Collisions in Object Placement Tasks
Komatsu, Takumi, Kambara, Motonari, Hatanaka, Shumpei, Matsuo, Haruka, Hirakawa, Tsubasa, Yamashita, Takayoshi, Fujiyoshi, Hironobu, Sugiura, Komei
Domestic service robots (DSRs) that support people in everyday environments have been widely investigated. However, their ability to predict and describe future risks resulting from their own actions remains insufficient. In this study, we focus on the linguistic explainability of DSRs. Most existing methods do not explicitly model the region of possible collisions; thus, they do not properly generate descriptions of these regions. In this paper, we propose the Nearest Neighbor Future Captioning Model that introduces the Nearest Neighbor Language Model for future captioning of possible collisions, which enhances the model output with a nearest neighbors retrieval mechanism. Furthermore, we introduce the Collision Attention Module that attends regions of possible collisions, which enables our model to generate descriptions that adequately reflect the objects associated with possible collisions. To validate our method, we constructed a new dataset containing samples of collisions that can occur when a DSR places an object in a simulation environment. The experimental results demonstrated that our method outperformed baseline methods, based on the standard metrics. In particular, on CIDEr-D, the baseline method obtained 25.09 points, whereas our method obtained 33.08 points.
Exploration, Path Planning with Obstacle and Collision Avoidance in a Dynamic Environment
Alirezazadeh, Saeid, Alexandre, Luís A.
If we give a robot the task of moving an object from its current position to another location in an unknown environment, the robot must explore the map, identify all types of obstacles, and then determine the best route to complete the task. We proposed a mathematical model to find an optimal path planning that avoids collisions with all static and moving obstacles and has the minimum completion time and the minimum distance traveled. In this model, the bounding box around obstacles and robots is not considered, so the robot can move very close to the obstacles without colliding with them. We considered two types of obstacles: deterministic, which include all static obstacles such as walls that do not move and all moving obstacles whose movements have a fixed pattern, and non-deterministic, which include all obstacles whose movements can occur in any direction with some probability distribution at any time. We also consider the acceleration and deceleration of the robot to improve collision avoidance.
- Europe > Portugal (0.04)
- Africa > Mozambique > Sofala Province > Beira (0.04)
- North America > United States > California > Monterey County > Pacific Grove (0.04)
- Africa > Guinea-Bissau > Bolama and Bijagos > Bolama (0.04)
- Information Technology > Artificial Intelligence > Representation & Reasoning > Constraint-Based Reasoning (0.93)
- Information Technology > Artificial Intelligence > Robots > Autonomous Vehicles (0.86)
- Information Technology > Artificial Intelligence > Representation & Reasoning > Planning & Scheduling (0.85)
Can Robots Save Us From Space Debris?
Using AI to track down space junk. Everyone is becoming increasingly concerned about Space Debris. Discarded rocket bodies are the largest pieces of debris and they're moving into Low Earth Orbit (LEO) as gravity pulls them towards the earth. Small chips of paint, bits of debris from explosions or collisions, and discarded parts all contribute. Close encounters of the debris kind are very common for those managing large numbers of operational satellites.